Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 45/115

Q: What is a skip list?
A. a linkedlist with size value in nodes
B. a linkedlist that allows faster search within an ordered sequence
C. a linkedlist that allows slower search within an ordered sequence
D. a tree which is in the form of linked list
Solution:  It is a datastructure, which can make search in sorted linked list faster in the same way as binary search tree and sorted array (using binary search) are faster.
Q: Skip lists are similar to which of the following datastructure?
A. stack
B. heap
C. binary search tree
D. balanced binary search tree
Solution: Skip lists have the same asymptotic time complexity as balanced binary search tree. For a Balanced Binary Search Tree, we skip almost half of the nodes after one comparison with root element. The same thing done in the skip lists. Hence skip lists are similar to balanced Binary search trees.
Q: What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
A. O(n) to O(logn) where n is number of elements
B. O(n) to O(1) where n is number of elements
C. no change
D. O(n) to O(n2) where n is number of elements
Solution: In Skip list we skip some of the elements by adding more layers. In this the skip list resembles balanced binary search trees. Thus we can change the time complexity from O (n) to O (logn)
Q: To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
A. balanced binary search trees
B. binary search trees
C. binary trees
D. linked lists
Solution: Skip lists are similar to any randomly built binary search tree. a BST is balanced because to avoid skew tree formations in case of sequential input and hence achieve O(logn) in all 3 cases. now skip lists can gurantee that O(logn) complexity for any input.
Q: The nodes in a skip list may have many forward references. their number is determined
A. probabilistically
B. randomly
C. sequentially
D. orthogonally
Solution: The number of forward references are determined probabilistically, that is why skip list is a probabilistic algorithm.
Q: Are the below statements true about skiplists?
In a sorted set of elements skip lists can implement the below operations
i.given a element find closest element to the given value in the sorted set in O(logn)
ii.find the number of elements in the set whose values fall a given range in O(logn)
A. true
B. false
C. ....
D. ....
Solution: To achieve above operations augment with few additional stuff like partial counts.
Q: How to maintain multi-level skip list properties when insertions and deletions are done?
A. design each level of a multi-level skip list with varied probabilities
B. that cannot be maintained
C. rebalancing of lists
D. reconstruction
Solution: For example consider a 2 level skip list. the level-2 skip list can skip one node on a average and at some places may skip 2 nodes, depending on probabilities. this ensures O(logn).
Q: Is a skip list like balanced tree?
A. true
B. false
C. ....
D. ....
Solution: Skip list behaves as a balanced tree with high probability and can be commented as such because nodes with different heights are mixed up evenly.
Q: What is indexed skip list?
A. it stores width of link in place of element
B. it stores index values
C. array based linked list
D. indexed tree
Solution: The width is defined as number of bottom layer links that are being traversed by each of higher layer elements. e.g: for a level-2 skip lists, all level-1 nodes have 1 as width, for level-2 width will be 2.

You Have Score    /9